Statistics of Blocks in k-Divisible Non-Crossing Partitions
نویسندگان
چکیده
منابع مشابه
Statistics of Blocks in k-Divisible Non-Crossing Partitions
We derive a formula for the expected number of blocks of a given size from a non-crossing partition chosen uniformly at random. Moreover, we refine this result subject to the restriction of having a number of blocks given. Furthermore, we generalize to k-divisible partitions. In particular, we find that in average the number of blocks of a k-divisible non-crossing partitions of nk elements is k...
متن کاملProducts of free random variables and k - divisible non - crossing partitions ∗
We derive a formula for the moments and the free cumulants of the multiplication of k free random variables in terms of k-equal and k-divisible non-crossing partitions. This leads to a new simple proof for the bounds of the right-edge of the support of the free multiplicative convolution μ , given by Kargin in [5], which show that the support grows at most linearly with k. Moreover, this combin...
متن کاملCombinatorial Statistics on Non-crossing Partitions
Four statistics, ls, rb, rs, and lb, previously studied on all partitions of { 1, 2, ..., n }, are applied to non-crossing partitions. We consider single and joint distributions of these statistics and prove equidistribution results. We obtain qand p, q-analogues of Catalan and Narayana numbers which refine the rank symmetry and unimodality of the lattice of non-crossing partitions. Two unimoda...
متن کاملTwo Statistics Linking Dyck Paths and Non-crossing Partitions
We introduce a pair of statistics, maj and sh, on Dyck paths and show that they are equidistributed. Then we prove that this maj is equivalent to the statistics ls and rb on non-crossing partitions. Based on non-crossing partitions, we give the most obvious q-analogue of the Narayana numbers and the Catalan numbers.
متن کاملSimply Generated Non-Crossing Partitions
We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing partitions with constraints on their block sizes. Our main tool is a bijection between non-crossing partitions and plane trees, which maps such simply generated non-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2012
ISSN: 1077-8926
DOI: 10.37236/2431